MULTIFOLD MINIMIZING OF UNDETERMINED FINITE AUTOMATION
(PART I. AUXILIARY FACTS AND ALGORITHMS)

Melnikov Boris Felixovich, Doctor of physical and mathematical sciences, professor, sub-department of applied mathematics and informatics, Tolyatti State University, B.Melnikov@tltsu.ru
Melnikova Alexandra Alexandrovna, Senior lecturer, sub-department of higher mathematics, Dimitrovgrad branch of Ulyanovsk State University, avahi@mail.ru

519.178

In the first part of the article, the authors consider some auxiliary algorithms for two problems of minimization of nondeterministic finite automata: vertex-minimization and edge-minimization. The researchers give a simple algorithm for minimization of deterministic automata, which also enables simultaneous construction of state-marking functions. The article proves some auxiliary propositions about input languages of the basis automaton states, necessary for algorithms of equivalent transformation of nondeterministic finite automata. 

nondeterministic finite automaton, basis automaton, algorithms of equivalent transformation, state-minimization, edge-minimization